#include <iostream>
using namespace std;

int F( int p[], int n, int m )
{
    if( m == 1 ) return ( n == 1 )? 1 : 0;

    int sum = 0;
    for( int i = 1; i <= ( n + 1 ) / 2; i++ )
    {
        if( i > p[m] ) break;

        p[m - 1] = i;
        sum += F( p, n - i, m - 1 );
    }
    return sum;
}

int F2( int p[], int n, int m )
{
    if( n < m ) return 0;
    if( m == 1 ) return !( 1 - n );

    int sum = 0;
    for( int i = ( n - 1 ) / ( m - 1 ); i <= ( n + 1 ) / 2; i++ )
    {
        if( i > p[m] ) break;

        p[m - 1] = i;
        sum += F( p, n - i, m - 1 );
    }
    return sum;
}

int main()
{
    int N, M;
    cin >> N >> M;
    int P[64] = {0};
    P[0] = 1;
    P[M] = N;
    cout << "Count: " << F2( P, N, M ) << endl;
    return 0;
}
